Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters
نویسندگان
چکیده
منابع مشابه
On Possibilistic Sequencing Problems with Fuzzy Parameters
In this paper a wide class of sequencing problems with imprecise parameters is discussed. The imprecision is modeled by using closed intervals and fuzzy intervals, whose membership functions are regarded as possibility distributions for the values of unknown parameters. A possibilistic interpretation of fuzzy problems is provided, some solution concepts are proposed and some algorithms for comp...
متن کاملDiscrete Optimization with Interval Data - Minmax Regret and Fuzzy Approach
One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain those all requirements when having much money? Why don't you try to get something simple at first? That's something that will lead you to know more about the world, adventure, some places, history, entertainment, and more? It is your own time to continue reading habit....
متن کاملMinmax regret solutions for minimax optimization problems with uncertainty
We propose a general approach for nding minmax regret solutions for a class of combinatorial optimization problems with an objective function of minimax type and uncertain objective function coe cients. The approach is based on reducing a problem with uncertainty to a number of problems without uncertainty. The method is illustrated on bottleneck combinatorial optimization problems, minimax mul...
متن کاملMinmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
This paper deals with a general combinatorial optimization problem in which closed intervals and fuzzy intervals model uncertain element weights. The notion of a deviation interval is introduced, which allows us to characterize the optimality and the robustness of solutions and elements. The problem of computing deviation intervals is addressed and some new complexity results in this field are ...
متن کاملMinmax regret combinatorial optimization problems: an Algorithmic Perspective
Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90’s and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Fuzzy Systems
سال: 2011
ISSN: 1063-6706
DOI: 10.1109/tfuzz.2011.2159982